Dissociation path forH2on Al(110)

Dissociation path for H2 on Al(110).

On computing the minimum 3-path vertex cover and dissociation number of graphs

The dissociation number of a graph G is the number of vertices in a maximum size induced subgraph of G with vertex degree at most 1. A k-path vertex cover of a graph G is a subset S of vertices of G such that every path of order k in G contains at least one vertex from S. The minimum 3-path vertex cover is a dual problem to the dissociation number. For this problem we present an exact algorithm...

Night-time experiences and daytime dissociation: a path analysis modeling study.

Dissociative symptoms may be the by-products of a labile sleep-wake cycle (Koffel and Watson, 2009a). This may help to explain why dissociation overlaps with fantasy proneness and cognitive failures. Using path analysis, we tested to what extent data gathered in a nonclinical, predominantly female sample (N=139) supported two conceptual models. The first model assumes that unusual sleep experie...

Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs

Path dissociation of visual signals entering the cortex: Disparity, contour orientation and position

Whether position and orientation shifts induced by monocular context also act as a disparity for purposes of stereoscopy was investigated experimentally in order to examine the extent to which lateral spatial localization and stereoscopic depth share circuitry. A monocular tilt illusion in a line does not lead to a commensurate depth tilt of that line in binocular view, nor does a position shif...